Gitik’s Gap 2 Short Extender Forcing
نویسنده
چکیده
In an Appalachian Set Theory Workshop [3], Gitik presented some of the details of a simplified version of the poset from his original paper. The discussion there motivates the definition of the forcing by modifying a poset which requires a stronger large cardinal assumption which is sometimes called the long extender forcing. However, the discussion recorded in the Appalachian Set Theory (AST) notes falls short of giving a complete account of this simplified forcing. The purpose of this paper is to fill in the gaps from the AST notes and so give a complete account of this simplified forcing. In particular we focus the proof that the final forcing has the κ-cc. Since the motivation for the poset is nicely outlined in the AST notes we jump straight into the technical details. One note on convention is in order. We depart from previous presentations of this poset by using p ≤ q to mean that p is stronger than q.
منابع مشابه
The short extenders gap two forcing is of Prikry type
We show that Gitik’s short extender gap-2 forcing is of Prikry
متن کاملPrikry Forcing with Long Extenders
In this note, we go through Gitik’s Long Extender forcing. In order to motivate it, work through the basic Pirkry forcing as well as the diagonal Prikry forcing. The presentation here is based on Spencer Unger’s lectures from the 2015 GSST in addition to Gitik’s Handbook chapter.
متن کاملCombining Short extenders forcings with Extender based Prikry
Change first the cofinality of κ to ω by adding a Prikry sequence ⟨κn | n < ω⟩ such that each κn is κ +n+2 n –strong. Then use the short extenders forcing which adds κ +ω+2 many cofinal ω-sequences to κ (after the preparation or simultaneously with it). All cardinals will be preserved then. If one does not care about falling of κ, then preform Gap 2 short extenders forcing. As a result κ will t...
متن کاملA Simpler Short Extenders Forcing - gap 3 Moti Gitik
Assume GCH. Let κ = ⋃ n<ω κn, 〈κn | n < ω〉 increasing, each κn is κ n – strong witnessed by (κn, κ +n+3 n ) – extender En. We would like to force 2 = κ preserving all the cardinals and without adding new bounded subsets to κ. It was done first in [2, Sec.3]. Here we present a different method of doing this. The advantage of the present construction is that the preparation forcing is split compl...
متن کاملExtender based forcings, fresh sets and Aronszajn trees
Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model with no Aronszajn tree over אω+2 from the optimal assumptions. This answers a question of Friedman and Halilović [1]. The reader interested only in Friedman and Halilović question may skip the first section and go directly to the second. 1 No branches to κAronszajn trees. We deal here wi...
متن کامل